Logic-based Benders Decomposition for Alternative Resource Scheduling with Sequence Dependent Setups
نویسندگان
چکیده
We study an unrelated parallel machines scheduling problem with sequence and machine dependent setup times. A logicbased Benders decomposition approach is proposed to minimize the makespan. This approach is a hybrid model that makes use of a mixed integer programming master problem and a specialized solver for travelling salesman subproblems. The master problem is used to assign jobs to machines while the subproblems obtain optimal schedules on each machine given the master problem assignments. Computational results show that the Benders model is able to find optimal solutions up to six orders of magnitude faster as well as solving problems six times the size previously possible with a mixed integer programming model in the literature and twice the size that a branchand-bound algorithm can solve for similar problems. We further relax the Benders decomposition to accept suboptimal schedules and demonstrate the ability to parameterize solution quality while outperforming state-of-the-art metaheuristics both in terms of solution quality and mean run-time.
منابع مشابه
A Logic-Based Benders Approach to Scheduling with Alternative Resources and Setup Times
We study an unrelated parallel machines scheduling problem with sequence and machine dependent setup times. A logicbased Benders decomposition approach is proposed to minimize the makespan. The decomposition approach is a hybrid model that makes use of a mixed integer programming master problem and a travelling salesman problem subproblem. The master problem is a relaxation of the problem and i...
متن کاملThe Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups
The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic me...
متن کاملDecomposition Methods for the Parallel Machine Scheduling Problem with Setups
We study the unrelated parallel machine scheduling problem with sequence and machine dependent setup times and the objective of makespan minimization. Two exact decomposition-based methods are proposed based on logic-based Benders decomposition and branch-and-check. These approaches are hybrid models that make use of a mixed integer programming master problem and a specialized solver for travel...
متن کاملSolving Resource Allocation/Scheduling Problems with Constraint Integer Programming
Constraint Integer Programming (CIP) is a generalization of mixed-integer programming (MIP) in the direction of constraint programming (CP) allowing the inference techniques that have traditionally been the core of CP to be integrated with the problem solving techniques that form the core of complete MIP solvers. In this paper, we investigate the application of CIP to scheduling problems that r...
متن کامل